We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 1-20 of 47 results
  1. Maximum Entropy

    This chapter presents the principle of maximum entropy, which furnishes a practical method for the generation of distributions. The representation of...
    Eduardo Souza de Cursi in Uncertainty Quantification with R
    Chapter 2024
  2. Some reflected autoregressive processes with dependencies

    Motivated by queueing applications, we study various reflected autoregressive processes with dependencies. Among others, we study cases where the...

    Ioannis Dimitriou, Dieter Fiems in Queueing Systems
    Article Open access 14 December 2023
  3. Polling: past, present, and perspective

    This is a survey on polling systems, focussing on the basic single-server multi-queue polling system in which the server visits the queues in cyclic...

    Sem Borst, Onno Boxma in TOP
    Article Open access 05 September 2018
  4. Performance Analysis of 2-Point Explicit Group (2-EG) Method for Solving Second-Order Composite Closed Newton-Cotes Quadrature System

    In this paper, the effectiveness of 2-Point Explicit Group (2-EG) iterative method with second-order composite closed Newton-Cotes (2-CCNC)...
    Mohana Sundaram Muthuvalu, Elayaraja Aruchunan, Jumat Sulaiman in Regional Conference on Science, Technology and Social Sciences (RCSTSS 2014)
    Conference paper 2016
  5. Hilbert transform, spectral filters and option pricing

    We show how spectral filters can improve the convergence of numerical schemes which use discrete Hilbert transforms based on a sinc function...

    Carolyn E. Phelan, Daniele Marazzina, ... Guido Germano in Annals of Operations Research
    Article 14 May 2018
  6. The cyclic queue and the tandem queue

    We consider a closed queueing network, consisting of two FCFS single server queues in series: a queue with general service times and a queue with...

    Onno Boxma, Hans Daduna in Queueing Systems
    Article 25 October 2013
  7. Jesús R. Artalejo 1963–2013

    A. Gómez-Corral in TOP
    Article 24 August 2013
  8. Modeling a case of herding behavior in a multi-player game

    The system mentioned in the title belongs to the family of the so-called massively multi-player online social games. It features a scoring system for...

    Guy Fayolle, Jean-Marc Lasgouttes in Queueing Systems
    Article 09 June 2013
  9. A retrial system with two input streams and two orbit queues

    Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a...

    Konstantin Avrachenkov, Philippe Nain, Uri Yechiali in Queueing Systems
    Article 01 August 2013
  10. The Seven Pillars of the Analytic Hierarchy Process

    The Analytic Hierarchy Process (AHP) provides the objective mathematics to process the inescapably subjective and personal preferences of an...
    Chapter 2012
  11. Power series approximations for two-class generalized processor sharing systems

    We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are nonempty, a...

    Joris Walraevens, J. S. H. van Leeuwaarden, Onno J. Boxma in Queueing Systems
    Article 25 August 2010
  12. Differential transform method for mathematical modeling of jamming transition problem in traffic congestion flow

    In this paper we aim to find an analytical solution for jamming transition in traffic flow. Generally the Jamming Transition Problem (JTP) can be...

    S. S. Ganji, A. Barari, ... G. Domairry in Central European Journal of Operations Research
    Article 11 July 2010
  13. Newton–Tau Method

    Many applied problems have their natural mathematical setting as integral and integro-differential equations, thus they usually have the advantage of...
    Karim Ivaz, Bahram Sadigh Mostahkam in Advances in Industrial Engineering and Operations Research
    Chapter 2008
  14. Sojourn times in (discrete) time shared systems and their continuous time limits

    We study the mean sojourn times in two M/G/1 weighted round-robin systems: the weight of a customer at any given point in time in the first system is...

    Arzad A. Kherani in Queueing Systems
    Article 25 October 2008
  15. A non-increasing Lindley-type equation

    In this paper we study the Lindley-type equation W =max {0, B A W }. Its main characteristic is that it is a non-increasing monotone function in its...

    Maria Vlasiou in Queueing Systems
    Article 23 May 2007
  16. On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts

    We consider a retrial queue with a finite buffer of size N , with arrivals of ordinary units and of negative units (which cancel one ordinary unit),...

    F. Avram, A. Gómez-Corral in Annals of Operations Research
    Article 01 January 2006
  17. A Tandem Queue with Coupled Processors: Computational Issues

    In Resing and Örmeci [16] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value...

    J. S. H. van Leeuwaarden, J. A. C. Resing in Queueing Systems
    Article 01 October 2005
  18. A MAP/G/1 Queue with Negative Customers

    In this paper, we consider a MAP / G /1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of...

    Quan-Lin Li, Yiqiang Q. Zhao in Queueing Systems
    Article 01 May 2004
Did you find what you were looking for? Share feedback.